On some structures of soft topology
نویسندگان
چکیده
منابع مشابه
Some properties of soft θ-topology
For dealing with uncertainties researchers introduced the concept of soft sets. Georgiou et al. [10] defined several basic notions on soft θ-topology and they studied many properties of them. This paper continues the study of the theory of soft θ-topological spaces and presents for this theory new definitions, characterizations, and results concerning soft θ-boundary, soft θ-exterior, soft θ-ge...
متن کاملTOPOLOGY OPTIMIZATION OF STRUCTURES UNDER TRANSIENT LOADS
In this article, an efficient methodology is presented to optimize the topology of structural systems under transient loads. Equivalent static loads concept is used to deal with transient loads and to solve an alternate quasi-static optimization problem. The maximum strain energy of the structure under the transient load during the loading interval is used as objective function. The objective f...
متن کاملOn Some Generalized Structures in Fuzzy Soft Topological Spaces
Molodstov introduced soft sets to deal with uncertainties and not clear objects. Researchers developed the relationship between soft sets and information systems. Fuzzification of the notions of soft sets and soft topology have been discussed in the literature. In this paper, we define and establish the topological structures of fuzzy soft semi-open sets and fuzzy soft semi-closed sets. We intr...
متن کاملON SOME STRUCTURES OF FUZZY NUMBERS
The operations in the set of fuzzy numbers are usually obtained bythe Zadeh extension principle. But these definitions can have some disadvantagesfor the applications both by an algebraic point of view and by practicalaspects. In fact the Zadeh multiplication is not distributive with respect tothe addition, the shape of fuzzy numbers is not preserved by multiplication,the indeterminateness of t...
متن کاملOn Symmetry of Some Nano Structures
It is necessary to generate the automorphism group of a chemical graph in computer-aided structure elucidation. An Euclidean graph associated with a molecule is defined by a weighted graph with adjacency matrix M = [dij], where for i≠j, dij is the Euclidean distance between the nuclei i and j. In this matrix dii can be taken as zero if all the nuclei are equivalent. Otherwise, one may introduce...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Sciences
سال: 2012
ISSN: 2251-7456
DOI: 10.1186/2251-7456-6-64